Measurement Matrix Construction Algorithm for Compressed Sensing based on QC-LDPC Matrix
نویسندگان
چکیده
منابع مشابه
The Chaotic Measurement Matrix for Compressed Sensing
How to construct a measurement matrix with good performance and easy hardware implementation is the core research problem in compressed sensing. In this paper, we present a simple and efficient measurement matrix named Incoherence Rotated Chaotic (IRC) matrix. We take advantage of the well pseudorandom of chaotic sequence, introduce the concept of the incoherence factor and rotation, and adopt ...
متن کاملA signal recovery algorithm for sparse matrix based compressed sensing
We have developed an approximate signal recovery algorithm with low computational cost for compressed sensing on the basis of randomly constructed sparse measurement matrices. The law of large numbers and the central limit theorem suggest that the developed algorithm saturates the Donoho-Tanner weak threshold for the perfect recovery when the matrix becomes as dense as the signal size N and the...
متن کاملA new method on deterministic construction of the measurement matrix in compressed sensing
Construction on the measurement matrix A is a central problem in compressed sensing. Although using random matrices is proven optimal and successful in both theory and applications. A deterministic construction on the measurement matrix is still very important and interesting. In fact, it is still an open problem proposed by T. Tao. In this paper, we shall provide a new deterministic constructi...
متن کاملA Structured Construction of Optimal Measurement Matrix for Noiseless Compressed Sensing via Analog Polarization
Abstract—In this paper, we propose a method of structured construction of the optimal measurement matrix for noiseless compressed sensing (CS), which achieves the minimum number of measurements which only needs to be as large as the sparsity of the signal itself to be recovered to guarantee almost error-free recovery, for sufficiently large dimension. To arrive at the results, we employ a dua...
متن کاملMatrix Co-Factorization on Compressed Sensing
In this paper we address the problem of matrix factorization on compressively-sampled measurements which are obtained by random projections. While this approach improves the scalability of matrix factorization, its performance is not satisfactory. We present a matrix co-factorization method where compressed measurements and a small number of uncompressed measurements are jointly decomposed, sha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Grid and Distributed Computing
سال: 2016
ISSN: 2005-4262,2005-4262
DOI: 10.14257/ijgdc.2016.9.2.11